The Hol Logic Extended with Quantiication over Type Variables
نویسنده
چکیده
The HOL system is an LCF-style mechanized proof-assistant for conducting proofs in higher order logic. This paper discusses a proposal to extend the primitive basis of the logic underlying the HOL system with a very simple form of quantiication over types. It is shown how certain practical problems with using the deenitional mechanisms of HOL would be solved by the additional expressive power gained by making this extension.
منابع مشابه
The HOL Logic Extended with Quantification over Type Variables
The HOL system is an LCF-style mechanized proof-assistant for conducting proofs in higher order logic. This paper discusses a proposal to extend the primitive basis of the logic underlying the HOL system with a very simple form of quantification over types. It is shown how certain practical problems with using the definitional mechanisms of HOL would be solved by the additional expressive power...
متن کاملThe HOL-Omega Logic
A new logic is posited for the widely used HOL theorem prover, as an extension of the existing higher order logic of the HOL4 system. The logic is extended to three levels, adding kinds to the existing levels of types and terms. New types include type operator variables and universal types as in System F . Impredicativity is avoided through the stratification of types by ranks according to the ...
متن کاملParametric Linear Arithmetic over Ordered Fields in Isabelle/HOL
We use higher-order logic to verify a quantifier elimination procedure for linear arithmetic over ordered fields, where the coefficients of variables are multivariate polynomials over another set of variables, we call parameters. The procedure generalizes Ferrante and Rackoff’s algorithm for the non-parametric case. The formalization is based on axiomatic type classes and automatically carries ...
متن کاملProof Search with Set Variable
We show how a procedure developed by Bledsoe for automatically nding substitution instances for set variables in higher-order logic can be adapted to provide increased automation in proof search in the Calculus of Constructions (CC). Bledsoe's procedure operates on an extension of rst-order logic that allows existential quantiication over set variables. The method nds maximal solutions for this...
متن کاملCS - - 1989 - 18 Higher - Order Logic as the Basis for Logic Programming
A generalization of Horn clauses to a higher-order logic is described and examined as a basis for logic programming. In qualitative terms, these higher-order Horn clauses are obtained from the rst-order ones by replacing rst-order terms with simply typed-terms and by permitting quantiication over all occurrences of function symbols and some occurrences of predicate symbols. Several proof-theore...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993